Path Counting and Random Matrix Theory

نویسندگان

  • Ioana Dumitriu
  • Etienne Rassart
چکیده

We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these identities arise from combinatorial interpretations of certain properties of the β-Hermite and β-Laguerre ensembles of random matrix theory. We conclude by presenting two other identities obtained in the same way, for which finding combinatorial proofs is an open problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

APPLICATION OF THE RANDOM MATRIX THEORY ON THE CROSS-CORRELATION OF STOCK ‎PRICES

The analysis of cross-correlations is extensively applied for understanding of interconnections in stock markets. Variety of methods are used in order to search stock cross-correlations including the Random Matrix Theory (RMT), the Principal Component Analysis (PCA) and the Hierachical ‎Structures.‎ In ‎this work‎, we analyze cross-crrelations between price fluctuations of 20 ‎company ‎stocks‎...

متن کامل

Quantum Chaos, Random Matrix Theory, and Statistical Mechanics in Two Dimensions - A Unified Approach

We present a theory where the statistical mechanics for dilute ideal gases can be derived from random matrix approach. We show the connection of this approach with Srednicki approach which connects Berry conjecture with statistical mechanics. We further establish a link between Berry conjecture and random matrix theory, thus providing a unified edifice for quantum chaos, random matrix theory an...

متن کامل

Quasi-birth-and-death Processes, Lattice Path Counting, and Hypergeometric Functions

In this paper we consider a class of quasi-birth-and-death processes for which explicit solutions can be obtained for the rate matrix R and the associated matrix G. The probabilistic interpretations of these matrices allow us to describe their elements in terms of paths on the two-dimensional lattice. Then determining explicit expressions for the matrices becomes equivalent to solving a lattice...

متن کامل

A Simple Approach to Global Regime of the Random Matrix Theory

We discuss a method of the asymptotic computation of moments of the normalized eigenvalue counting measure of random matrices of large order. The method is based on the resolvent identity and on some formulas relating expectations of certain matrix functions and the expectations including their derivatives or, equivalently, on some simple formulas of the perturbation theory. In the framework of...

متن کامل

A Block-Wise random sampling approach: Compressed sensing problem

The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2003